Detecting Quantified Global Predicates in Parallel Programs

نویسنده

  • Mark Minas
چکیده

Global predicates in parallel programs are predicates considering the state of more than one process. They are a useful concept for debugging parallel programs, e.g., for specifying assertions or breakpoints. In this paper 9-predicates are defined and examined, a restricted class of global predicates. 9-predicates are defined by two local predicates which have to be simultaneously satisfied by two different processes.Such predicates are frequently neededto express synchronization properties. Efficient centralized and parallel algorithms for detecting satisfaction of9-predicates are proposed.Furthermore, it is outlined how 9-predicates can be used for global breakpoints and where to stop a parallel program reaching such a breakpoint. The underlying machine models is a fixed set of processes communicating by message passing or shared memory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Debugging Parallel Distributed Programs

Analysing and debugging parallel and distributed programs is usually a difficult and not well explored problem. This is largely due to the non-deterministic nature of the run-time states of these processes, and results in a general lack of adequate parallel debugging tools. In this paper, we present solutions for the problem of detecting global generalized conjunctive predicates (GCP). For this...

متن کامل

Fast Detection of Stable and Count Predicates in Parallel Computations

Enumerating all consistent states of a parallel computation that satisfy a given predicate is an important problem in debugging and verification of parallel programs. We give a fast algorithm to enumerate all consistent states of a parallel computation that satisfy a stable predicate. In addition, we define a new category of global predicates called count predicates and give an algorithm to enu...

متن کامل

Detection of Weak Unstable Predicates in Distributed Programs

|This paper discusses detection of global predicates in a distributed program. Earlier algorithms for detection of global predicates proposed by Chandy and Lamport work only for stable predicates. A predicate is stable if it does not turn false once it becomes true. Our algorithms detect even unstable predicates without excessive overhead. In the past, such predicates have been regarded as too ...

متن کامل

Predicate Detection for Parallel Computations with Locking Constraints

The happened-before model (or the poset model) has been widely used for modeling the computations (execution traces) of parallel programs and detecting predicates (user-specified conditions). This model captures potential causality as well as locking constraints among the executed events of computations using Lamport’s happened-before relation. The detection of a predicate in a computation is p...

متن کامل

Efficient Vector Clock for Predicate Detection in Multithreaded Programs

Monitoring global predicates is a fundamental concern in distributed and concurrent systems for its importance during the design, testing and debugging phases of program development. In this paper, we present a generalization of local predicates called the chain predicates. In the context of multithreaded programs, these predicates can be thought of as predicates defined over shared variables i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995